Weak multipliers for generalized van der Corput sequences
نویسندگان
چکیده
Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P (i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b − 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences. Manuscrit reçu le 12 février 2012, révisé le 25 avril 2012. This work is supported by the Graduate School of IST Austria (Institute of Science and Technology Austria). Mots clefs. Uniform distribution, diaphony, generalized van der Corput sequence. Classification math. 11K06, 11K38. 730 Florian Pausinger
منابع مشابه
The Discrepancy of Generalized Van-der-corput-halton Sequences
The purpose of this paper is to provide upper bounds for the discrepancy of generalized Van-der-Corput-Halton sequences that are built from Halton sequences and the Zeckendorf Van-der-Corput sequence.
متن کاملImprovements on Low Discrepancy One-dimensional Sequences and Two-dimensional Point Sets
We obtain significant improvements for the star discrepancy D∗ of generalized van der Corput sequences by means of linear digit scramblings (see Section 5.2 for the definition). We also find a new lower bound for the extreme discrepancyD of these sequences which permits to show that linearly-scrambled sequences are set in a good place among generalized van der Corput sequences. Finally, we deri...
متن کاملRegularities of the distribution of abstract van der Corput sequences
Similarly to β-adic van der Corput sequences, abstract van der Corput sequences can be defined by abstract numeration systems. Under some assumptions, these sequences are low discrepancy sequences. The discrepancy function is computed explicitly, and the bounded remainder sets of the form [0, y) are characterized.
متن کاملAverage Performance of Quasi Monte Carlo Methods for Global Optimization 3 VAN DER CORPUT SEQUENCES
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability prior on all optimized functions. We show how to construct van der Corput sequences and we prove their consistency. Numerical experimentation shows that the van der Corput sequence in base 2 has a better average perfor...
متن کاملThe distribution of m-ary search trees generated by van der Corput sequences
The distribution of m-ary search trees generated by van der Corput sequences We study the structure of m-ary search trees generated by the van der Corput sequences. The height of the tree is calculated and a generating function approach shows that the distribution of the depths of the nodes is asymptotically normal. Additionally a local limit theorem is derived.
متن کامل